Enumerating the strings of regular languages

Enumerating the Strings of a Regular Expression

Enumerating Regular Expressions and Their Languages

In this chapter we discuss the problem of enumerating distinct regular expressions bysize and the regular languages they represent. We discuss various notions of the size of a regularexpression that appear in the literature and their advantages and disadvantages. We consider aformal definition of regular expressions using a context-free grammar.We then show how to enumerate stri...

Enumerating Regular Mixed-Cell Configurations

By means of the Cayley Trick the problem of enumerating all regular ne mixed subdivisions is reduced to enumerating all regular triangulations. The set of all regular triangulations is well-understood thanks to the bijection with the vertices of the secondary polytope. However, since we are only interested in the conngurations of mixed cells in a mixed subdivision, we want to avoid dealing with...

TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES

We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...

Languages Of Analogical Strings

A : B = C : D, put four strings of symbols into \proportions." They render an account of, for instance, look : looked = walk : walked or fable : fabulous = miracle : miraculous, on the level of strings of symbols. They are not intended to deal directly with, for instance, bird : wings = sh : ns or work : worked = go : went which suppose knowledge about the world or the tongue (Ho man 95). Analo...